Shortest path planning for mobile chargers

Approximation Algorithms for Shortest Path Motion Planning

This paper gives approximation algorithms for solving the following motion planning problem: Given a set of polyhedral obstacles and points s and t, find a shortest path from s to t that avoids the obstacles. The paths found by the algorithms are piecewise linear, and the length of a path is the sum of the lengths of the line segments making up the path. Approximation algorithms will be given f...

Direction Weighted Shortest Path Planning

Planning wireless networks by shortest path

Transmitters and receivers are the basic elements of wireless networks and are characterized by a number of radio-electrical parameters. A general planning problem consists in establishing suitable values for these parameters so as to optimize some network performance indicator. In this paper we consider a version of the problem called the Power Assignment Problem (PAP), that is the problem of ...

Shortest path planning on topographical maps

This thesis introduces a new algorithm for quickly answering repetitive least-cost queries between pairs of points on the Earth's surface as represented by digital topographical maps. The algorithm uses a three-step process; preprocessing, geometrically modified Dijkstra search, and postprocessing. The preprocessing step computes and saves highly valuable global information that describes the u...

ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS

We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...